TSTP Solution File: NUM636^2 by Zipperpin---2.1.9999
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : NUM636^2 : TPTP v8.1.2. Released v3.7.0.
% Transfm : NO INFORMATION
% Format : NO INFORMATION
% Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.4HxiLZx1Td true
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 12:42:56 EDT 2023
% Result : Theorem 1.23s 0.80s
% Output : Refutation 1.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 8
% Syntax : Number of formulae : 41 ( 11 unt; 4 typ; 0 def)
% Number of atoms : 85 ( 60 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 226 ( 46 ~; 14 |; 5 &; 120 @)
% ( 0 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 4 usr; 6 con; 0-2 aty)
% ( 23 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 46 ( 23 ^; 23 !; 0 ?; 46 :)
% Comments :
%------------------------------------------------------------------------------
thf(one_type,type,
one: $i ).
thf('#sk61_type',type,
'#sk61': $i ).
thf('#sk1_type',type,
'#sk1': $i ).
thf(succ_type,type,
succ: $i > $i ).
thf(satz2,conjecture,
! [X: $i] :
( ( succ @ X )
!= X ) ).
thf(zf_stmt_0,negated_conjecture,
~ ! [X: $i] :
( ( succ @ X )
!= X ),
inference('cnf.neg',[status(esa)],[satz2]) ).
thf(zip_derived_cl3,plain,
~ ( !!
@ ^ [Y0: $i] :
( ( succ @ Y0 )
!= Y0 ) ),
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(zip_derived_cl4,plain,
( ( succ @ '#sk1' )
!= '#sk1' ),
inference(lazy_cnf_exists,[status(thm)],[zip_derived_cl3]) ).
thf(zip_derived_cl5,plain,
( ( succ @ '#sk1' )
= '#sk1' ),
inference('simplify nested equalities',[status(thm)],[zip_derived_cl4]) ).
thf(induction,axiom,
! [M: $i > $o] :
( ( ! [X: $i] :
( ( M @ X )
=> ( M @ ( succ @ X ) ) )
& ( M @ one ) )
=> ! [Y: $i] : ( M @ Y ) ) ).
thf(zip_derived_cl2,plain,
( !!
@ ^ [Y0: $i > $o] :
( ( ( !!
@ ^ [Y1: $i] :
( ( Y0 @ Y1 )
=> ( Y0 @ ( succ @ Y1 ) ) ) )
& ( Y0 @ one ) )
=> ( !!
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(cnf,[status(esa)],[induction]) ).
thf(zip_derived_cl24,plain,
! [X2: $i > $o] :
( ( ( !!
@ ^ [Y0: $i] :
( ( X2 @ Y0 )
=> ( X2 @ ( succ @ Y0 ) ) ) )
& ( X2 @ one ) )
=> ( !!
@ ^ [Y0: $i] : ( X2 @ Y0 ) ) ),
inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl2]) ).
thf(zip_derived_cl25,plain,
( ( ( !!
@ ^ [Y0: $i] :
( ( ( succ @ Y0 )
!= Y0 )
=> ( ( succ @ ( succ @ Y0 ) )
!= ( succ @ Y0 ) ) ) )
& ( ( succ @ one )
!= one ) )
=> ( !!
@ ^ [Y0: $i] :
( ( succ @ Y0 )
!= Y0 ) ) ),
inference(triggered_bool_instantiation,[status(thm)],[zip_derived_cl24]) ).
thf(one_is_first,axiom,
! [X: $i] :
( ( succ @ X )
!= one ) ).
thf(zip_derived_cl0,plain,
( !!
@ ^ [Y0: $i] :
( ( succ @ Y0 )
!= one ) ),
inference(cnf,[status(esa)],[one_is_first]) ).
thf(zip_derived_cl6,plain,
! [X2: $i] :
( ( succ @ X2 )
!= one ),
inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl0]) ).
thf(zip_derived_cl7,plain,
! [X2: $i] :
( ( succ @ X2 )
!= one ),
inference('simplify nested equalities',[status(thm)],[zip_derived_cl6]) ).
thf(zip_derived_cl98,plain,
( ( ( !!
@ ^ [Y0: $i] :
( ( ( succ @ Y0 )
!= Y0 )
=> ( ( succ @ ( succ @ Y0 ) )
!= ( succ @ Y0 ) ) ) )
& $true )
=> ( !!
@ ^ [Y0: $i] :
( ( succ @ Y0 )
!= Y0 ) ) ),
inference(inner_simplify_reflect,[status(thm)],[zip_derived_cl25,zip_derived_cl7]) ).
thf(zip_derived_cl99,plain,
( ( !!
@ ^ [Y0: $i] :
( ( ( succ @ Y0 )
!= Y0 )
=> ( ( succ @ ( succ @ Y0 ) )
!= ( succ @ Y0 ) ) ) )
=> ( !!
@ ^ [Y0: $i] :
( ( succ @ Y0 )
!= Y0 ) ) ),
inference('simplify boolean subterms',[status(thm)],[zip_derived_cl98]) ).
thf(zip_derived_cl100,plain,
( ~ ( !!
@ ^ [Y0: $i] :
( ( ( succ @ Y0 )
!= Y0 )
=> ( ( succ @ ( succ @ Y0 ) )
!= ( succ @ Y0 ) ) ) )
| ( !!
@ ^ [Y0: $i] :
( ( succ @ Y0 )
!= Y0 ) ) ),
inference(lazy_cnf_imply,[status(thm)],[zip_derived_cl99]) ).
thf(zip_derived_cl101,plain,
( ~ ( ( ( succ @ '#sk61' )
!= '#sk61' )
=> ( ( succ @ ( succ @ '#sk61' ) )
!= ( succ @ '#sk61' ) ) )
| ( !!
@ ^ [Y0: $i] :
( ( succ @ Y0 )
!= Y0 ) ) ),
inference(lazy_cnf_exists,[status(thm)],[zip_derived_cl100]) ).
thf(zip_derived_cl103,plain,
( ( ( succ @ ( succ @ '#sk61' ) )
!= ( succ @ '#sk61' ) )
| ( !!
@ ^ [Y0: $i] :
( ( succ @ Y0 )
!= Y0 ) ) ),
inference(lazy_cnf_imply,[status(thm)],[zip_derived_cl101]) ).
thf(zip_derived_cl106,plain,
( ( ( succ @ ( succ @ '#sk61' ) )
= ( succ @ '#sk61' ) )
| ( !!
@ ^ [Y0: $i] :
( ( succ @ Y0 )
!= Y0 ) ) ),
inference('simplify nested equalities',[status(thm)],[zip_derived_cl103]) ).
thf(zip_derived_cl107,plain,
! [X2: $i] :
( ( ( succ @ X2 )
!= X2 )
| ( ( succ @ ( succ @ '#sk61' ) )
= ( succ @ '#sk61' ) ) ),
inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl106]) ).
thf(zip_derived_cl110,plain,
! [X2: $i] :
( ( ( succ @ X2 )
!= X2 )
| ( ( succ @ ( succ @ '#sk61' ) )
= ( succ @ '#sk61' ) ) ),
inference('simplify nested equalities',[status(thm)],[zip_derived_cl107]) ).
thf(zip_derived_cl127,plain,
( ( '#sk1' != '#sk1' )
| ( ( succ @ ( succ @ '#sk61' ) )
= ( succ @ '#sk61' ) ) ),
inference('sup-',[status(thm)],[zip_derived_cl5,zip_derived_cl110]) ).
thf(zip_derived_cl129,plain,
( ( succ @ ( succ @ '#sk61' ) )
= ( succ @ '#sk61' ) ),
inference(simplify,[status(thm)],[zip_derived_cl127]) ).
thf(succ_injective,axiom,
! [X: $i,Y: $i] :
( ( ( succ @ X )
= ( succ @ Y ) )
=> ( X = Y ) ) ).
thf(zip_derived_cl1,plain,
( !!
@ ^ [Y0: $i] :
( !!
@ ^ [Y1: $i] :
( ( ( succ @ Y0 )
= ( succ @ Y1 ) )
=> ( Y0 = Y1 ) ) ) ),
inference(cnf,[status(esa)],[succ_injective]) ).
thf(zip_derived_cl10,plain,
! [X2: $i] :
( !!
@ ^ [Y0: $i] :
( ( ( succ @ X2 )
= ( succ @ Y0 ) )
=> ( X2 = Y0 ) ) ),
inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl1]) ).
thf(zip_derived_cl11,plain,
! [X2: $i,X4: $i] :
( ( ( succ @ X2 )
= ( succ @ X4 ) )
=> ( X2 = X4 ) ),
inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl10]) ).
thf(zip_derived_cl12,plain,
! [X2: $i,X4: $i] :
( ( ( succ @ X2 )
!= ( succ @ X4 ) )
| ( X2 = X4 ) ),
inference(lazy_cnf_imply,[status(thm)],[zip_derived_cl11]) ).
thf(zip_derived_cl13,plain,
! [X2: $i,X4: $i] :
( ( ( succ @ X2 )
!= ( succ @ X4 ) )
| ( X2 = X4 ) ),
inference('simplify nested equalities',[status(thm)],[zip_derived_cl12]) ).
thf(zip_derived_cl180,plain,
! [X0: $i] :
( ( ( succ @ X0 )
!= ( succ @ '#sk61' ) )
| ( X0
= ( succ @ '#sk61' ) ) ),
inference('sup-',[status(thm)],[zip_derived_cl129,zip_derived_cl13]) ).
thf(zip_derived_cl192,plain,
( '#sk61'
= ( succ @ '#sk61' ) ),
inference(eq_res,[status(thm)],[zip_derived_cl180]) ).
thf(zip_derived_cl102,plain,
( ( ( succ @ '#sk61' )
!= '#sk61' )
| ( !!
@ ^ [Y0: $i] :
( ( succ @ Y0 )
!= Y0 ) ) ),
inference(lazy_cnf_imply,[status(thm)],[zip_derived_cl101]) ).
thf(zip_derived_cl104,plain,
( ( ( succ @ '#sk61' )
!= '#sk61' )
| ( !!
@ ^ [Y0: $i] :
( ( succ @ Y0 )
!= Y0 ) ) ),
inference('simplify nested equalities',[status(thm)],[zip_derived_cl102]) ).
thf(zip_derived_cl105,plain,
! [X2: $i] :
( ( ( succ @ X2 )
!= X2 )
| ( ( succ @ '#sk61' )
!= '#sk61' ) ),
inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl104]) ).
thf(zip_derived_cl108,plain,
! [X2: $i] :
( ( ( succ @ X2 )
!= X2 )
| ( ( succ @ '#sk61' )
!= '#sk61' ) ),
inference('simplify nested equalities',[status(thm)],[zip_derived_cl105]) ).
thf(zip_derived_cl109,plain,
( ( succ @ '#sk61' )
!= '#sk61' ),
inference(condensation,[status(thm)],[zip_derived_cl108]) ).
thf(zip_derived_cl196,plain,
$false,
inference('simplify_reflect-',[status(thm)],[zip_derived_cl192,zip_derived_cl109]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM636^2 : TPTP v8.1.2. Released v3.7.0.
% 0.00/0.13 % Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.4HxiLZx1Td true
% 0.12/0.34 % Computer : n010.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri Aug 25 08:08:50 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % Running portfolio for 300 s
% 0.12/0.34 % File : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.34 % Number of cores: 8
% 0.12/0.34 % Python version: Python 3.6.8
% 0.12/0.35 % Running in HO mode
% 0.20/0.63 % Total configuration time : 828
% 0.20/0.63 % Estimated wc time : 1656
% 0.20/0.63 % Estimated cpu time (8 cpus) : 207.0
% 0.20/0.70 % /export/starexec/sandbox2/solver/bin/lams/40_c.s.sh running for 80s
% 0.20/0.72 % /export/starexec/sandbox2/solver/bin/lams/15_e_short1.sh running for 30s
% 0.20/0.72 % /export/starexec/sandbox2/solver/bin/lams/40_c_ic.sh running for 80s
% 0.20/0.73 % /export/starexec/sandbox2/solver/bin/lams/35_full_unif4.sh running for 80s
% 0.20/0.74 % /export/starexec/sandbox2/solver/bin/lams/40_noforms.sh running for 90s
% 0.20/0.75 % /export/starexec/sandbox2/solver/bin/lams/20_acsne_simpl.sh running for 40s
% 0.20/0.77 % /export/starexec/sandbox2/solver/bin/lams/40_b.comb.sh running for 70s
% 0.20/0.79 % /export/starexec/sandbox2/solver/bin/lams/30_sp5.sh running for 60s
% 1.23/0.80 % Solved by lams/35_full_unif4.sh.
% 1.23/0.80 % done 17 iterations in 0.054s
% 1.23/0.80 % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 1.23/0.80 % SZS output start Refutation
% See solution above
% 1.23/0.80
% 1.23/0.80
% 1.23/0.80 % Terminating...
% 1.23/0.85 % Runner terminated.
% 1.23/0.86 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------